package zuoye;

import java.util.HashMap;
import java.util.HashSet;

/**
 * @author zhangshuai
 * @version V1.0
 * @Project Java2_26
 * @Package zuoye
 * @Description:
 * @Date 2025/5/19 10:16
 */

public class Demo1 {

    static final int DEFAULT_INITIAL_CAPACITY = 1 << 4;
    static final int MAXIMUM_CAPACITY = 1 << 30;
    public static void main(String[] args) {
        HashMap<Object, Object> map = new HashMap<>();

        // 0001 << 4  10000 16  负载因子 0.75  16 * 0.75 = 12 进行扩容


    }

    // 根据给定的容量cap，返回一个大于等于cap的最小的2的幂次方

}

class Student implements Comparable<Student> {
    private String name;
    private int age;

    @Override
    public int compareTo(Student o) {
        //this > o  升序    o - this 降序
        return this.age - o.age;
    }
}